The Generalized Maximum Coverage Problem
نویسندگان
چکیده
منابع مشابه
The Generalized Maximum Coverage Problem
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 + )-approximation for every > 0, and then use partial enumeration to reduce the approximation ratio to e e−1 + .
متن کاملThe Budgeted Maximum Coverage Problem
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted elements, and a budget L, nd a subset of S 0 S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1 ? 1 e...
متن کاملTwo-Dimensional Maximum p-Coverage Problem with Partial Coverage
In this paper, we introduce a new generalization of the classical maximum p-coverage problem (MCP) in which p geometric objects of known dimensions are to be located such that their union covers maximum weight distributed on a two-dimensional plane using another set of geometric objects such as circles, rectangles, polygons, etc. We allow partial coverage in the foregoing generalization and den...
متن کاملTypical Approximation Performance for Maximum Coverage Problem
This study investigated the typical performance of approximation algorithms known as belief propagation, the greedy algorithm, and linear-programming relaxation for maximum coverage problems in sparse biregular random graphs. After we used the cavity method for a corresponding hard-core lattice-gas model, results showed that two distinct thresholds of replica-symmetry and its breaking exist in ...
متن کامل2 Maximum Coverage 2.1 Problem Definition
In the previous lecture we covered polynomial time reductions and approximation algorithms for vertex cover and set cover problems. By reductions we showed that SAT, 3SAT, Independent Set, Vertex Cover, Integer Programming, and Clique problems are NP-Hard. In this lecture we will continue to cover approximation algorithms for maximum coverage and metric TSP problems. We will also cover Strong N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.03.017